Distortion in Attribute Approval Committee Elections.
|
AAMAS |
2023 |
0 |
Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections.
|
AAMAS |
2023 |
0 |
On the Average-Case Complexity of Predicting Round-Robin Tournaments.
|
AAMAS |
2022 |
0 |
Time-Constrained Participatory Budgeting Under Uncertain Project Costs.
|
IJCAI |
2022 |
1 |
Complexity of Scheduling and Predicting Round-Robin Tournaments.
|
AAMAS |
2021 |
2 |
Complexity of Sequential Rules in Judgment Aggregation.
|
AAMAS |
2021 |
0 |
Acceptance in incomplete argumentation frameworks.
|
Artificial Intelligence |
2021 |
15 |
Complexity of Manipulative Interference in Participatory Budgeting.
|
ADT |
2021 |
0 |
Manipulation of Opinion Polls to Influence Iterative Elections.
|
AAMAS |
2020 |
5 |
Towards Reality: Smoothed Analysis in Computational Social Choice.
|
AAMAS |
2020 |
11 |
Irresolute Approval-based Budgeting.
|
AAMAS |
2020 |
4 |
Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract.
|
AAMAS |
2020 |
4 |
Generalized Distance Bribery.
|
AAAI |
2019 |
8 |
Manipulative Design of Scoring Systems.
|
AAMAS |
2019 |
1 |
How Hard Is the Manipulative Design of Scoring Systems?.
|
IJCAI |
2019 |
3 |
Verification in incomplete argumentation frameworks.
|
Artificial Intelligence |
2018 |
37 |
Complexity of Verification in Incomplete Argumentation Frameworks.
|
AAAI |
2018 |
8 |
Positional scoring-based allocation of indivisible goods.
|
Autonomous Agents and Multi-Agent Systems |
2017 |
0 |
Minisum and Minimax Committee Election Rules for General Preference Types.
|
ECAI |
2016 |
7 |
Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types.
|
ADT |
2015 |
5 |
Winner Determination and Manipulation in Minisum and Minimax Committee Elections.
|
ADT |
2015 |
14 |
Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods.
|
IJCAI |
2015 |
18 |
Voter Dissatisfaction in Committee Elections.
|
AAMAS |
2015 |
14 |
Verification in Attack-Incomplete Argumentation Frameworks.
|
ADT |
2015 |
16 |
Verification in Argument-Incomplete Argumentation Frameworks.
|
ADT |
2015 |
16 |
Scoring Rules for the Allocation of Indivisible Goods.
|
ECAI |
2014 |
16 |
Computational Aspects of Manipulation and Control in Judgment Aggregation.
|
ADT |
2013 |
28 |
Campaigns for lazy voters: truncated ballots.
|
AAMAS |
2012 |
94 |
The Possible Winner Problem with Uncertain Weights.
|
ECAI |
2012 |
24 |
Computational complexity of two variants of the possible winner problem.
|
AAMAS |
2011 |
42 |
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation.
|
ADT |
2011 |
33 |
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules.
|
ECAI |
2010 |
68 |